The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

cond(true, x) → cond(odd(x), p(p(p(x))))
odd(0) → false
odd(s(0)) → true
odd(s(s(x))) → odd(x)
p(0) → 0
p(s(x)) → x

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
odd(s(s(x))) →⁺ odd(x)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [x / s(s(x))].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

cond(true, x) → cond(odd(x), p(p(p(x))))
odd(0') → false
odd(s(0')) → true
odd(s(s(x))) → odd(x)
p(0') → 0'
p(s(x)) → x

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
cond(true, x) → cond(odd(x), p(p(p(x))))
odd(0') → false
odd(s(0')) → true
odd(s(s(x))) → odd(x)
p(0') → 0'
p(s(x)) → x

Types:
cond :: true:false → 0':s → cond
true :: true:false
odd :: 0':s → true:false
p :: 0':s → 0':s
0' :: 0':s
false :: true:false
s :: 0':s → 0':s
hole_cond1_0 :: cond
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
cond, odd

They will be analysed ascendingly in the following order:
odd < cond

(8) Obligation:

TRS:
Rules:
cond(true, x) → cond(odd(x), p(p(p(x))))
odd(0') → false
odd(s(0')) → true
odd(s(s(x))) → odd(x)
p(0') → 0'
p(s(x)) → x

Types:
cond :: true:false → 0':s → cond
true :: true:false
odd :: 0':s → true:false
p :: 0':s → 0':s
0' :: 0':s
false :: true:false
s :: 0':s → 0':s
hole_cond1_0 :: cond
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

The following defined symbols remain to be analysed:
odd, cond

They will be analysed ascendingly in the following order:
odd < cond

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
odd(gen_0':s4_0(*(2, n6_0))) → false, rt ∈ Ω(1 + n6₀)

Induction Base:
odd(gen_0':s4_0(*(2, 0))) →_R^Ω(1)
false

Induction Step:
odd(gen_0':s4_0(*(2, +(n6_0, 1)))) →_R^Ω(1)
odd(gen_0':s4_0(*(2, n6_0))) →_IH
false

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

TRS:
Rules:
cond(true, x) → cond(odd(x), p(p(p(x))))
odd(0') → false
odd(s(0')) → true
odd(s(s(x))) → odd(x)
p(0') → 0'
p(s(x)) → x

Types:
cond :: true:false → 0':s → cond
true :: true:false
odd :: 0':s → true:false
p :: 0':s → 0':s
0' :: 0':s
false :: true:false
s :: 0':s → 0':s
hole_cond1_0 :: cond
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Lemmas:
odd(gen_0':s4_0(*(2, n6_0))) → false, rt ∈ Ω(1 + n6₀)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

The following defined symbols remain to be analysed:
cond

(12) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol cond.

(13) Obligation:

TRS:
Rules:
cond(true, x) → cond(odd(x), p(p(p(x))))
odd(0') → false
odd(s(0')) → true
odd(s(s(x))) → odd(x)
p(0') → 0'
p(s(x)) → x

Types:
cond :: true:false → 0':s → cond
true :: true:false
odd :: 0':s → true:false
p :: 0':s → 0':s
0' :: 0':s
false :: true:false
s :: 0':s → 0':s
hole_cond1_0 :: cond
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Lemmas:
odd(gen_0':s4_0(*(2, n6_0))) → false, rt ∈ Ω(1 + n6₀)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

No more defined symbols left to analyse.

(14) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
odd(gen_0':s4_0(*(2, n6_0))) → false, rt ∈ Ω(1 + n6₀)

(15) BOUNDS(n^1, INF)

(16) Obligation:

TRS:
Rules:
cond(true, x) → cond(odd(x), p(p(p(x))))
odd(0') → false
odd(s(0')) → true
odd(s(s(x))) → odd(x)
p(0') → 0'
p(s(x)) → x

Types:
cond :: true:false → 0':s → cond
true :: true:false
odd :: 0':s → true:false
p :: 0':s → 0':s
0' :: 0':s
false :: true:false
s :: 0':s → 0':s
hole_cond1_0 :: cond
hole_true:false2_0 :: true:false
hole_0':s3_0 :: 0':s
gen_0':s4_0 :: Nat → 0':s

Lemmas:
odd(gen_0':s4_0(*(2, n6_0))) → false, rt ∈ Ω(1 + n6₀)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))

No more defined symbols left to analyse.

(17) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
odd(gen_0':s4_0(*(2, n6_0))) → false, rt ∈ Ω(1 + n6₀)

(18) BOUNDS(n^1, INF)